A note on a generalization of eigenvector centrality for bipartite graphs and applications

摘要

Eigenvector centrality is a linear algebra based graph invariant used invarious rating systems such as webpage ratings for search engines. Ageneralization of the eigenvector centrality invariant is defined which ismotivated by the need to design rating systems for bipartite graph models oftime-sensitive and other processes. The linear algebra connection and someapplications are described.